Network Programming and Probabilistic Sketching for Securing the Data Plane

Undecidable Problems for Probabilistic Network Programming

The software-defined networking language NetKAT is able to verify many useful properties of networks automatically via a PSPACE decision procedure for program equality. However, for its probabilistic extension ProbNetKAT, no such decision procedure is known. We show that several potentially useful properties of ProbNetKAT are in fact undecidable, including emptiness of support intersection and ...

the search for the self in becketts theatre: waiting for godot and endgame

this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...

a robust fuzzy-probabilistic programming model for a reliable supply chain network design problem

supply chain network design decisions are among the strategic decisions of supply chain management which play significant role on the efficient performance of the supply chain. however, there are two challenging factors which may have great impact on the supply chain performance. these factors are on the one hand disruptions and their attendant damages and on the other hand uncertain nature of ...

Probabilistic Data Analysis with Probabilistic Programming

Probabilistic techniques are central to data analysis, but different approaches can be difficult to apply, combine, and compare. This paper introduces composable generative population models (CGPMs), a computational abstraction that extends directed graphical models and can be used to describe and compose a broad class of probabilistic data analysis techniques. Examples include hierarchical Bay...

Space-efficient data sketching algorithms for network applications